A Study on Memory-Based Communications and Synchronization in Distributed-Memory Systems
نویسنده
چکیده
In terms of facilities for communications and synchronization in parallel programs, the descriptive power of the shared-memory model is equal to that of the message-passing-style (send-and-receive-type) model. From the viewpoint of performance, however,the situation is different. In modern architectures for distributedmemory multicomputers, memory is an important and fundamental building-block of the nodes. It is thus directly accessed by processors that use their memory management units for protection and virtualization. Therefore, a very convenient way of improving performance or increasing the variety of functions is to have the communication/synchronization subsystems handle information related to the memory locations at which target data are stored. In more concrete terms, if communication/synchronization subsystems do so, they can use the information to reduce the number of copies of data. Moreover, these subsystems have been made capable of directly accessing data in user tasks, it becomes possible to implement advanced synchronization functions (e.g., atomic operations, queue operations and so forth), as well as simple read/write operations, within the subsystems. In short, communication/synchronization subsystems based on the shared-memory model are superior in this way to message-passing-style subsystems which simply relay data from one task to another. This conclusion holds whether the subsystem is implemented in hardware or software. In this thesis, the Memory-Based Communications and Synchronization (MBCS) scheme is proposed. In this scheme, recognition and exploitation of information on the locations of target data by communication/synchronization subsystems is proposed, along with brand-new mechanisms based on this scheme. Effectiveness of the overall scheme is then shown by experimental verification and by discussion and analysis. Going into more detail, subsystems based on the MBCS scheme are classified into three categories that correspond to the different grain sizes of data within operations and on implementation methodology. A communication/synchronization mechanism for each category is then proposed. The first mechanism, called the Memory-Based Processor (MBP), is a hardware-implemented fine-grained communication/synchronization mechanism. The MBP is also a building-block for hardware-based distributed shared memory. The second is the Memory-Based Communication Facility (MBCF) which is a software-implemented medium-grained communication/synchronization mechanism made with off-the-shelf network hardware. The third is the the Memory-Based Processor II (MBP2), a hardware-implemented medium-grained mechanism which was designed and developed on the basis of research results on the MBCF. In this thesis, (1) brand-new functions to run on these mechanisms are proposed, (2) explanations of their behaviors and of high-speed implementation methods are given, (3) comparisons are made with other existing mechanisms, qualitative discussions are presented, and (4) experimental verification is described. Through these discussions, the effectiveness of the MBCS scheme will be made clear.
منابع مشابه
Effects of gabaergic and morphinergic systems in CA1 nucleus on anxiety and arousal memory based on test-retest paradigm
Hippocampus is a key structure in anxiety processing and memory storage. The purpose of this study was to investigate the interaction between GABAergic systems in CA1 area of hippocampus with morphinergic system in modulating of these behaviors. In this study, male wistar rats were cannulated with stereotaxic surgery in CA1 site. After a recovery period, morphine (µ opioid receptor agonist) was...
متن کاملOn the Synchronization Mechanisms in Distributed Shared Memory Systems
Distributed Shared Memory (DSM) is the implementation of the shared memory programming paradigm on a distributed memory (or multicomputer) system. Programming multicomputer systems using Distributed Shared Memory as the programming model is appealing because it combines the performance advantage of distributed memory systems and the ease of programming of shared memory systems. In DSM systems, ...
متن کاملLinear matrix inequality approach for synchronization of chaotic fuzzy cellular neural networks with discrete and unbounded distributed delays based on sampled-data control
In this paper, linear matrix inequality (LMI) approach for synchronization of chaotic fuzzy cellular neural networks (FCNNs) with discrete and unbounded distributed delays based on sampled-data controlis investigated. Lyapunov-Krasovskii functional combining with the input delay approach as well as the free-weighting matrix approach are employed to derive several sufficient criteria in terms of...
متن کاملCompiler-Assisted Distributed Shared Memory Schemes Using Memory-Based Communication Facilities
To execute shared-memory-based parallel programs efficiently, we introduce two compiler-assisted software cache schemes which are well-suited to automatic optimizations of remote communications. One scheme is a full user-level software cache (User-level Distributed Shared Memory: UDSM) and another is a page-based cache (Asymmetric Distributed Shared Memory: ADSM) which exploits TLB/MMU only in ...
متن کاملCollective Memory as a Measure to Evaluate the Infill Architecture Innovations in Historic Contexts (Case Study: Historic Context of Imamzadeh Yahya in Tehran)
Historic contexts remind us of an era when cities were built based on the needs, goals, and preferences of their inhabitants. In other words, the mental world of both the builders and the inhabitants was closely interrelated. But by ignoring citizens' memories and interests and their mental needs, today's interventions with rapid developments within historic contexts have led to amnesia and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001